Concatenated Conjugate Codes
نویسنده
چکیده
A conjugate code pair is defined as a pair of linear codes either of which contains the dual of the other. A conjugate code pair represents the essential structure of the corresponding Calderbank-Shor-Steane (CSS) quantum code. It is known that conjugate code pairs are applicable to (quantum) cryptography. We give a construction method for efficiently decodable conjugate code pairs.
منابع مشابه
Minimum Distance of Concatenated Conjugate Codes for Cryptography and Quantum Error Correction
A polynomial construction of error-correcting codes for secure and reliable information transmission is presented. The constructed codes are essentially Calderbank-Shor-Steane (CSS) quantum codes, and hence are also useful for quantum error correction. The asymptotic relative minimum distance of these codes is evaluated, and shown to be larger than that of the codes constructed by Chen, Ling, a...
متن کاملConcatenated error-correcting entropy codes and channel codes
We propose a general class of concatenated errorcorrecting entropy codes and channel codes. In this way we extend and generalize the existing body of work on iterative decoding of entropy and channel codes. Using the structure and properties of serial concatenated codes, we employ error-correcting entropy codes as the outer code, and a convolutional code as the inner code. The generalization fr...
متن کاملAnalysis and Design of Concatenated Codes
A new general concatenated code structure, containing both parallel and serially concatenated codes as special cases, is presented. The structure provides a unified framework for the analysis of concatenated codes and offers new degrees of freedom for code design. Performance analysis based on bounds on the error probability in the error floor region and suggestions for suitable design criteria...
متن کاملA Note on Performance of Generalized Tail Biting Trellis Codes
Tail biting trellis codes and block concatenated codes are discussed from random coding arguments. Error exponents and decoding complexity for generalized tail biting (GTB) random trellis codes, and their relationships are derived, where the GTB trellis codes consist of full tail biting (FTB) trellis codes, partial tail biting (PTB) trellis codes and direct truncated (DT) trellis codes. We show...
متن کاملExponential Error Bounds for Block Concatenated Codes with Tail Biting Trellis Inner Codes
Tail biting trellis codes and block concatenated codes are discussed from random coding arguments. An error exponent and decoding complexity for tail biting random trellis codes are shown. Then we propose a block concatenated code constructed by a tail biting trellis inner code and derive an error exponent and decoding complexity for the proposed code. The results obtained by the proposed code ...
متن کامل